例句與造句

1. The same principle has also been used to develop more complicated algorithms for non-bipartite matching with the same asymptotic running time as the Hopcroft Karp algorithm.
2. In 1998, Bogdan Chlebus proposed a simpler algorithm with the same asymptotic running time for the common special cases where " d " is 3 or 4.
3. Brandes'algorithm for computing the betweenness centrality of all vertices was modified to compute the group betweenness centrality of one group of nodes with the same asymptotic running time.
4. The best published asymptotic running time is for the general number field sieve ( GNFS ) algorithm, which, for a " b "-bit number " n ", is:
5. Using Fibonacci heaps for priority queues improves the asymptotic running time of important algorithms, such as Dijkstra's algorithm for computing the shortest path between two nodes in a graph, compared to the same algorithm using other slower priority queue data structures.
6. It's difficult to find asymptotic running time in a sentence. 用asymptotic running time造句挺難的
7. Chan's algorithm, another convex hull algorithm, combines the logarithmic dependence of Graham scan with the output sensitivity of the gift wrapping algorithm, achieving an asymptotic running time O ( n \ log h ) that improves on both Graham scan and gift wrapping.
8. Under the heuristic assumption that there are sufficiently many small Elkies primes, and excluding the cost of computing modular polynomials, the asymptotic running time of the SEA algorithm is O ( n ^ 2 M ( n ^ 2 ) / \ log { n } ) = O ( n ^ { 4 + o ( 1 ) } ), where n = \ log { q }.